package lanQiao;

public class FibonacciFactory
{
	public static void main(String[] args)
	{

			int[] n = new int[2];
			n[0] = n[1] = 1;

			int j = 0;

			for (int i=10; i-- > 2;)
			{
				j = 1 - j;
				n[j] = (n[0] + n[1]) % 10007;
			}

			System.out.println(n[j]);
		
	}
}
